SAT Modulo BDD -- A Combined Verification Approach for Incomplete Designs
نویسندگان
چکیده
We introduce a novel method that integrates BDD-based symbolic model checking into SAT-based bounded model checking in the presence of unknowns. By incorporating both distinctively different methods, our new hybrid verification tool can take advantage of what each type of model checking has to offer. We present a case study for which both the BDD-based method as well as the SAT-based method are unable to provide a proof that the considered property fails, but that can be solved using the integrated approach.
منابع مشابه
Model Checking: From BDDs to Interpolation
In this paper we describe the development of model checking from BDD-based verification, through SAT-based bug finding, to Interpolation-based verification. Model checking is an automatic approach to formally verifying that a given system satisfies a given specification. BDD-based Symbolic Model Checking (SMC) was the first to enable model checking of real-life designs with a few hundreds of st...
متن کاملEquivalence Checking Combining a Structural SAT-Solver, BDDs, and Simulation
This paper presents a verification technique for functional comparison of large combinational circuits using a novel combination of known approaches. The idea is based on a tight integration of a structural satisfiability (SAT) solver, BDD sweeping, and random simulation; all three working on a shared graph representation of the circuit. The BDD sweeping and SAT solver are applied in an intertw...
متن کاملSAT-based Combinational Equivalence Checking
Combinational equivalence checking is one of the key components in today’s hardware verification methodology. Structural similarity of the two designs are exploited by existing BDD, SAT, or ATPG based methods. This report presents a technique for improving the performance of the existing SAT-based combinational equivalence checkers by adding new constraints based on the structural similarity. O...
متن کاملSTABLE: Combining Satisfiability Solving, Boolean Reasoning and Computer Algebra for System-on-Chip Verification
This paper presents a new satisfiability (SAT) modulo Theory (SMT) solver, STABLE, for formulas of the quantifierfree logic over fixed-sized bit vectors (QF-BV). As the primary application domain for STABLE we target an SMT-based property checking flow for System-on-Chip (SoC) designs. STABLE integrates a computer-algebra-based engine which provides algorithms for proving arithmetic problem par...
متن کاملEvaluation of SAT like Proof Techniques for Formal Verification of Word Level Circuits
Word level information on the Register Transfer Level (RTL) offers information for efficient guidance of the proof process in formal verification. Therefore several proof techniques with integrated word level support from other research fields can be applied for formal verification of circuit designs as well. The focus of this work is to evaluate the proof techniques Boolean Satisfiability (SAT...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010